const github.com/klauspost/compress/zstd.bestShortLen

10 uses

	github.com/klauspost/compress/zstd (current package)
		enc_best.go#L25: 	bestShortLen       = 4                       // Bytes used for table hash
		enc_best.go#L204: 		nextHashS := hashLen(cv, bestShortTableBits, bestShortLen)
		enc_best.go#L306: 			candidateS = e.table[hashLen(cv>>8, bestShortTableBits, bestShortLen)]
		enc_best.go#L322: 				improve(&best, e.table[hashLen(cv2>>8, bestShortTableBits, bestShortLen)].offset-e.cur, s+3, uint32(cv2>>8), -1)
		enc_best.go#L385: 				h1 := hashLen(cv0, bestShortTableBits, bestShortLen)
		enc_best.go#L445: 			h1 := hashLen(cv0, bestShortTableBits, bestShortLen)
		enc_best.go#L495: 			nextHash := hashLen(cv, hashLog, bestShortLen)      // 0 -> 4
		enc_best.go#L496: 			nextHash1 := hashLen(cv>>8, hashLog, bestShortLen)  // 1 -> 5
		enc_best.go#L497: 			nextHash2 := hashLen(cv>>16, hashLog, bestShortLen) // 2 -> 6
		enc_best.go#L498: 			nextHash3 := hashLen(cv>>24, hashLog, bestShortLen) // 3 -> 7